Discrete Sequential Search for One of Many Objects

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Continuous and Discrete Search for One of Many Objects

By an easy observation we show that the basic result of Blackwell, according to which the most inviting strategy is optimal in a discrete search for one object, is also true when the number of objects is random provided the search is made in continuous time. This result does not hold in the discrete search model even when only two boxes are present (contrary to a conjecture of Smith and Kimeldo...

متن کامل

Discrete Sequential Search

Before the search it is impossible to predict how many looks will be necessary to locate the target. A policy is a plan of search that tells where the nth look will be made--should it be necessary. For any policy, if P ( k ) is the probabil i ty tha t the target is found on or before the kth look, C(]c) is the total cost of the first k looks, and C is the random total cost, then the expectation...

متن کامل

A Many to One Discrete Auditory Transform

A many to one discrete auditory transform is presented to map a sound signal to a perceptually meaningful spectrum on the scale of human auditory filter band widths (critical bands). A generalized inverse is constructed in closed analytical form, preserving the band energy and band signal to noise ratio of the input sound signal. The forward and inverse transforms can be implemented in real tim...

متن کامل

SYMBIOTIC ORGANISMS SEARCH AND HARMONY SEARCH ALGORITHMS FOR DISCRETE OPTIMIZATION OF STRUCTURES

In this work, a new hybrid Symbiotic Organisms Search (SOS) algorithm introduced to design and optimize spatial and planar structures under structural constraints. The SOS algorithm is inspired by the interactive behavior between organisms to propagate in nature. But one of the disadvantages of the SOS algorithm is that due to its vast search space and a large number of organisms, it may trap i...

متن کامل

Search-based many-to-one component substitution

In this paper, we present a search-based automatic many-to-one component substitution mechanism. When a component is removed from an assembly to overcome component obsolescence, failure or unavailability, most existing systems perform component-tocomponent (one-to-one) substitution. Thus, they only handle situations where a specific candidate component is available. As this is not the most freq...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Annals of Statistics

سال: 1975

ISSN: 0090-5364

DOI: 10.1214/aos/1176343191